Set partitions as geometric words
نویسندگان
چکیده
Using an analytic method, we derive an alternative formula for the probability that a geometrically distributed word of length n possesses the restricted growth property. Equating our result with a previously known formula yields an algebraic identity involving alternating sums of binomial coefficients via a probabilistic argument. In addition, we consider refinements of our formula obtained by fixing the number of blocks, levels, rises, or descents.
منابع مشابه
Set partitions, words, and approximate counting with black holes
Words satisfying the restricted growth property wk ≤ 1 + max{w0, . . . , wk−1} are in correspondence with set partitions. Underlying the geometric distribution to the letters, these words are enumerated with respect to the largest letter occurring, which corresponds to the number of blocks in the set partition. It turns out that on average, this parameter behaves like log1/q n, where q is the p...
متن کاملLimit Behavior of Maxima in Geometric Words representing Set Partitions
We consider geometric words ω1 · · ·ωn with letters satisfying the restricted growth property ωk ≤ d + max{ω0, . . . , ωk−1}, where ω0 := 0 and d ≥ 1. For d = 1 these words are in 1-to-1 correspondence with set partitions and for this case we show that the number of left-to-right maxima (suitable centered) does not converge to a fixed limit law as n tends to infinity. This becomes wrong for d ≥...
متن کاملStirling number of the fourth kind and lucky partitions of a finite set
The concept of Lucky k-polynomials and in particular Lucky χ-polynomials was recently introduced. This paper introduces Stirling number of the fourth kind and Lucky partitions of a finite set in order to determine either the Lucky k- or Lucky χ-polynomial of a graph. The integer partitions influence Stirling partitions of the second kind.
متن کاملOn packing densities of set partitions
We study packing densities for set partitions, which is a generalization of packing words. We use results from the literature about packing densities for permutations and words to provide packing densities for set partitions. These results give us most of the packing densities for partitions of the set {1, 2, 3}. In the final section we determine the packing density of the set partition {{1, 3}...
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 53 شماره
صفحات -
تاریخ انتشار 2012